Solving Longest Common Subsequence Problem with Memetic Algorithms
نویسندگان
چکیده
Pattern discovery in unaligned DNA sequences is a challenge problem. A pattern is some specific nucleotide combination that it can be used to measure the similarity degree among biological sequences. The longest common subsequence (LCS) can be viewed as a pattern discovery problem and it is also a well-known NP-hard problem. In this paper, we present a memetic algorithm-based approach to solve this problem. Experimental results on DNA sequences are presented to illustrate the effectiveness of the proposed approach.
منابع مشابه
Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences
By reviewing Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS), the Longest Common Increasing Subsequence (LCIS) problem is explored for two non-random input cases in details. Specifically, we designed two algorithms, one solving the input sequence scenario with the case that one sequence is ordered and duplicate elements are allowed in each of sequences, and the second ...
متن کاملConstrained Longest Common Subsequence Computing Algorithms in Practice
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longest subsequence C of A and B such that P is a subsequence of C. There are several algorithms solving the CLCS problem, but there is no real experimental comparison of them. The paper has two aims. Firstly, we propose a...
متن کاملA Comparative Study of Different Longest Common Subsequence Algorithms
The longest common subsequence is a classical problem which is solved by using the dynamic programming approach. The LCS problem has an optimal substructure: the problem can be broken down into smaller, simple "subproblems", which can be broken down into yet simpler subproblems, and so on, until, finally, the solution becomes trivial. The LCS problem also has overlapping subproblems: the soluti...
متن کاملFast algorithm for constrained longest common subsequence problem
The problem of finding the constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. The best known algorithms for its solving requires time of order of a product of the sequences length. We introduce a novel approach in which time and memory complexities depends on the number of matches between A, B, and P . The time complex...
متن کاملNew Algorithms for the Longest Common Subsequence Problem New Algorithms for the Longest Common Subsequence Problem New Algorithms for the Longest Common Subsequence Problem
Given two sequences A = a 1 a 2 : : :a m and B = b 1 b 2 : : :b n , m n, over some alphabet , a common subsequence C = c 1 c 2 : : :c l of A and B is a sequence that can be obtained from both A and B by deleting zero or more (not necessarily adjacent) symbols. Finding a common subsequence of maximallength is called the Longest CommonSubsequence (LCS) Problem. Two new algorithms based on the wel...
متن کامل